Towards the Tree Automata Workbench Marbles
نویسنده
چکیده
The conceptual ideas that are intended to become the basis for the tree automata workbench MARBLES are sketched. The goal is to design and implement an extensible system that facilitates experiments with virtually any kind of algorithm on tree automata. Moreover, the system will be released with a library and an application programmer’s interface to make it accessible to anyone who wants to apply tree automata algorithms in research and development.
منابع مشابه
Multidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملNEW DIRECTION IN FUZZY TREE AUTOMATA
In this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of $Nondeterministic$ $Fuzzy$$Finite$ $Tree$ $Automata$ (NFFTA). Initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). Inorder to eliminate these limitations and increasing theefficiency of FFTA, we defin...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملTowards a workbench for schema-TAGs
In the following the components of a workbench for the grommar formalism of Schema-Tree Adjoining Grammars (S-TAGs) are outlined. This workbench can also serve as a workbench for pure TA Gs because it provides a component which transforms an arbitrory TAG into an S-TAG in a non-trivial manner. Another interesting property of the workbench is that it provides a parser, which is realized as a rev...
متن کاملMIO Workbench: A Tool for Compositional Design with Modal Input/Output Interfaces
Modal Input/Output interfaces (MIOs) is a new specification theory for systems communicating via inputs and outputs. The approach combines the advantages of both modal automata and interface automata, two dominant specification theories for component-based design. This paper presents the MIO Workbench that is the first complete implementation of the MIO theory.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ECEASST
دوره 26 شماره
صفحات -
تاریخ انتشار 2010